Mutually embeddable models of ZFC
نویسندگان
چکیده
We investigate systems of transitive models ZFC which are elementarily embeddable into each other and the influence definability properties on such systems.
منابع مشابه
Large families of mutually embeddable vertex-transitive graphs
For each infinite cardinal , we give examples of 2 many nonisomorphic vertex-transitive graphs of order that are pairwise isomorphic to induced subgraphs of each other. We consider examples of graphs with these properties that are also universal, in the sense that they embed all graphs with smaller orders as induced subgraphs. 2003 Wiley Periodicals, Inc. J Graph Theory 43: 99–106, 2003
متن کاملMutually embeddable graphs and the tree alternative conjecture
We prove that if a rayless tree T is mutually embeddable and non-isomorphic with another rayless tree, then T is mutually embeddable and non-isomorphic with infinitely many rayless trees. The proof relies on a fixed element theorem of Halin, which states that every rayless tree has either a vertex or an edge that is fixed by every self-embedding. We state a conjecture that proposes an extension...
متن کاملMinimal Collapsing Extensions of Models of ZFC
We present some results concerning extensions of models of ZFC in which cofinalities of cardinals are changed and/or cardinals are collapsed, in particular on minimal such extensions. Our main tools are perfect tree forcing PF(S) and Namba forcing Nm(S). We prove that if N 2 M is an extension such that (i) M k K = I+ > H,, (ii) 1 fl N E M and (iii) N = Mlf] for some cofinal f : oo+ K, then N 2 ...
متن کاملLarge transitive models in local ZFC
This paper is a sequel to [7], where a local version of ZFC, LZFC, was introduced and examined and transitive models of ZFC with properties that resemble large cardinal properties, namely Mahlo and Π1-indescribable models, were considered. By analogy we refer to such models as “large models”, and the properties in question as “large model properties”. Continuing here in the same spirit we consi...
متن کاملDecontamination of Mutually Contaminated Models
A variety of machine learning problems are characterized by data sets that are drawn from multiple different convex combinations of a fixed set of base distributions. We call this a mutual contamination model. In such problems, it is often of interest to recover these base distributions, or otherwise discern their properties. This work focuses on the problem of classification with multiclass la...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Pure and Applied Logic
سال: 2023
ISSN: ['0168-0072', '1873-2461']
DOI: https://doi.org/10.1016/j.apal.2023.103325